On the Minimum Distances of Non-Binary Cyclic Codes
نویسندگان
چکیده
We deal with the minimum distances of q-ary cyclic codes of length qm − 1 generated by products of two distinct minimal polynomials, give a necessary and sufficient condition for the case that the minimum distance is two, show that the minimum distance is at most three if q > 3, and consider also the case q = 3.
منابع مشابه
Some new binary codes with improved minimum distances
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this paper, a method to conduct a computer search for binary 2-generator QC codes is presented, and a large number of good 2-generator QC codes have been obtained. 5 new binary QC codes that improve the lower bounds on minimum distance are presented. Furthermore, with new 2-generator QC codes and Constr...
متن کاملSome results on the weight structure of cyclic codes of composite length
In this work we investigate the weight structure of cyclic codes of composite length n = n l n 2 , where n1 and n2 are relatively prime. The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cy...
متن کاملOn squares of cyclic codes
The square C of a linear error correcting code C is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in C. Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications one is concerned about some of the parameters (dimension, minimum distance) of both C and C. In th...
متن کاملA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...
متن کاملNew Good Quasi-cyclic Codes over Gf(3)
Abstract In this paper some good quasi-cyclic codes over GF(3) are presented. These quasi-cyclic codes improve the already known lower bounds on the minimum distance of the previously known quasi-cyclic codes. Even though these codes do not improve the minimum distance of the best unstructured code known, their beautiful structure and simplicity provide several advantages in comparison to other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 17 شماره
صفحات -
تاریخ انتشار 1999